Common transversals for partitions of a finite set

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Common transversals for partitions of a finite set

For s 2, t 1, let A1; : : : ;At be s-cell partitions of a finite set X . Assume that if x;y 2 X , x 6= y, then x;y belong to different cells of at least one of the partitions Ai. For each k 1, let c(s; t;k) be the least integer such that if A1; : : : ;At , X satisfy the preceding conditions, and the smallest of all the cells of all the partitions has exactly k elements, and jX j c(s; t;k), then...

متن کامل

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

Partitions of a Finite Partially Ordered Set

In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...

متن کامل

Partitions with Parts in a Finite Set

Abstract. For a finite set A of positive integers, we study the partition function pA(n). This function enumerates the partitions of the positive integer n into parts in A. We give simple proofs of some known and unknown identities and congruences for pA(n). For n in a special residue class, pA(n) is a polynomial in n. We examine these polynomials for linear factors, and the results are applied...

متن کامل

Partitions of the Set of Finite Sequences

Our starting point is the following question. Given F : c o < ~ 2, a partition of the finite sequences of natural numbers into two pieces, is there a sequence of pairs of numbers, H0, H 1 ..... such that for every n~co the product I]7=o Hi is contained in one of the pieces of the partition? It is easy to find a partition for which no such homogenous sequence of pairs exist (see [ C D P ] ) , bu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1984

ISSN: 0012-365X

DOI: 10.1016/0012-365x(84)90065-7